Description: 太原理工大学硕 士 学 位 论 文 摘 要 网络缓存（Web Caching）把经常访问的网络对象在访问开 销较少的网络节点上存一个副本，当用户再次访问这些对象时， 可以直接从这个开销较少的网络节点上得到满足。从而在有限 的带宽内，达到缩短用户等待时间、提高网络性能和网络可扩 展性的目的，对于提高Internet 访问效率具有重要意义。-Taiyuan University of Technology master's degree thesis Abstract network cache (Web Caching) frequent visits to the network to visit the object of the less expensive network nodes onto a copy, when users visit these objects, directly from the overhead less network nodes to be met. Thus the limited bandwidth, which can shorten the waiting time for customers, improve network performance and network scalability for the purpose of improving the efficiency of Internet access is of vital significance. Platform: |
Size: 100561 |
Author:西风飘雪 |
Hits:
Description: 太原理工大学硕 士 学 位 论 文 摘 要 网络缓存（Web Caching）把经常访问的网络对象在访问开 销较少的网络节点上存一个副本，当用户再次访问这些对象时， 可以直接从这个开销较少的网络节点上得到满足。从而在有限 的带宽内，达到缩短用户等待时间、提高网络性能和网络可扩 展性的目的，对于提高Internet 访问效率具有重要意义。-Taiyuan University of Technology master's degree thesis Abstract network cache (Web Caching) frequent visits to the network to visit the object of the less expensive network nodes onto a copy, when users visit these objects, directly from the overhead less network nodes to be met. Thus the limited bandwidth, which can shorten the waiting time for customers, improve network performance and network scalability for the purpose of improving the efficiency of Internet access is of vital significance. Platform: |
Size: 100352 |
Author:西风飘雪 |
Hits:
Description: 生成BA 小世界网络java 源程序，里面涉及到结点类RipplePeer可以另行自己实现，主要就是几个成员变量id，neighbors数组（与之连接的结点）和degree度数-BA small-world networks generated java source code, which relates to node can be its own category RipplePeer realize, the main variable is the number of members of id, neighbors array (connected nodes) and degree degrees Platform: |
Size: 1024 |
Author: |
Hits:
Description: 1、提取原蛋白质相互作用网络的所有节点
2、分别计算原蛋白质相互作用网络每个节点的度
3、从所有节点中选择具有最高度的节点，反复的添加边，直到它的度值等于原蛋白质相互作用网络该节点的度值
4、在为节点添加边时，从剩余节点中选择节点的方法是其度分布近似服从power-low分布
5、令t的值为零，则每个节点被选到的可能性都是相同的，由于在原蛋白质相互作用网络存在大量的低度节点，所以集散节点会优先连接低度节点。
这样创建的网络就为负相关蛋白质互作网络
-1, extract the original protein-protein interaction network of all nodes 2, respectively, the original calculation of protein-protein interaction network of each node of degree 3, from all nodes in the selection of the highest degree of node, add edge repeatedly until its value equal to the original protein-protein interaction network of the node value of 4, in order to add the edge node from the remaining nodes select the node is its degree distribution similar to obey power-low distribution of 5, so that the value of t is zero, each node was to the possibility of election are the same, as in the original protein-protein interaction network of the existence of a large number of low-level node, the node will be distributed so low priority to connect nodes. This network created for the negative correlation of protein interaction networks Platform: |
Size: 969728 |
Author:徐荣波 |
Hits:
Description: 复杂网络 节点度统计程序 C++
网络中的节点度指与节点相连的边的个数-Complex statistical procedures for network nodes C++ Network nodes and node degrees refers to the number of connected edge Platform: |
Size: 2048 |
Author:owen |
Hits:
Description: 基于K-means聚类算法的社团发现方法
先定义了网络中节点关联度,并构建了节点关联度矩阵, 在此基础上给出了一种基于 K-means聚类算法的复杂网络社团发现方法。
以最小关联度原则选取新的聚类中心, 以最大关联度原则进行模式归类,直到所有的节点都划分完为止, 最后根据模块度来确定理想的社团数-K-means clustering algorithm based on the association discovery
To define a network node correlation, and build the node correlation matrix in this basis, given a K-means clustering algorithm based on a complex network of associations that way.
The principle of the minimum correlation to select a new cluster center to the principle of maximum correlation pattern classification until all the nodes are divided until the end, the last under the module to determine the degree of the ideal number of community Platform: |
Size: 115712 |
Author:maverick |
Hits:
Description: 基于Barabasi-Albert模型的建立无尺度网络生长模型。控制参数：平均出度m，结点数n。输出所有入度点数比例；输出直方图分段比例；输出集散节点-Based on Barabasi-Albert model of scale-free network growth model. Control parameters: the average out-degree m, the number of nodes n. Output ratio of all penetration points output histogram segmentation ratio output hubs Platform: |
Size: 10240 |
Author:maverick |
Hits:
Description: 社交网络中一些点是中枢点，这些点在社交网络中占有重要地位，但是计算结点连接度的复杂度比较高，这篇论文主要做了改进算法效率的工作-Social network is the central point of some points, these points in the social network plays an important role, but the computing nodes connected relatively high degree of complexity, this paper mainly done to improve the working efficiency of the algorithm Platform: |
Size: 573440 |
Author:lovell |
Hits:
Description: This provides a look at the Broadcast Storm problem, as well as Phase Transition phenomena that hold the key to one possible solution.
Wireless networks of reasonable density possess a high degree of redundancy in that, if a message is broadcast to the entire network using naive flooding, the message is received multiple times by most nodes (from different neighbors).
Platform: |
Size: 14336 |
Author:asbel |
Hits:
Description: 此程序用于求有向网路和无向网路的节点的度-This procedure is used to beg for the degree of the nodes of the network to the Internet and no Platform: |
Size: 1024 |
Author:Jason |
Hits:
Description: 神经网络是一种模范动物神经网络行为特征，进行分布式并行信息处理的算法数学模型。这种网络依靠系统的复杂程度，通过调整内部大量节点之间相互连接的关系，从而达到处理信息的目的。
-The neural network is a model animal neural network behavioral characteristics of distributed parallel algorithm mathematical model of information processing. Such networks rely on the degree of complexity of the system by adjusting the internal a large number of mutual connections between nodes, so as to achieve the purpose of processing information. Platform: |
Size: 1024 |
Author:csy |
Hits:
Description: 计算网络图中节点的度，即计算与某一节点相连的节点的个数-Computing nodes in the network map degree, which is a measure associated with a number of nodes connected to the node Platform: |
Size: 1024 |
Author:王蓝 |
Hits:
Description: 可以求出复杂网络中两节点间的距离以及平均路径长度，各节点的度及度的分布曲线，以及节点的聚类系数。-You can find out the distance and average path length between the two nodes in complex networks .you can also find out degree and degree distribution curve of each node, and the node clustering coefficient. Platform: |
Size: 5120 |
Author:陈兆 |
Hits:
Description: ER 模型网络生成的matlab代码
计算网络的度分布、集簇系数
网络科学作业
-ER model
generate a random network of nodenum nodes with probability of 0.1 and calculate average degree, average clustering coefficient and degree distribution Platform: |
Size: 1024 |
Author:陈力 |
Hits:
Description: 给定一定数量的节点，给定一定的平均度的要求画出一个复杂网络-Given a certain number of nodes, given a certain degree requirements mean to draw a complex network Platform: |
Size: 1024 |
Author:王岩 |
Hits:
Description: 为了降低算法的时间复杂度，Vincent Blondel等人提出了另一种层次性贪心算法（BGLL算法）。该算法包括两个阶段，这两个阶段重复迭代运行，直到网络社区划分的模块度不再增长。第一阶段合并社区，算法将每个节点当作一个社区，基于模块度增量最大化标准决定哪些邻居社区应该被合并。经过一轮扫描后开始第二阶段，算法将第一阶段发现的所有的社区重新看作节点，构建新的网络，在新的网络上迭代的进行第一阶段。当模块度不再增长时，得到网络的社区近似最优划分。
算法的基本步骤如下：
1）.初始化，将每个节点划分在不同的社区中。
2）.逐一选择各个节点，根据公式计算将它划分到它的邻居社区中得到的模块度增益。如果最大增益大于0，则将它划分到对应的邻居社区；否则，保持归属于原社区。
3）.重复步骤2，直到节点的社区不再发生变化。
4）.构建新图。新图中的点代表上一阶段产生的不同社区，边的权重为两个社区中所有节点对的边权重之和。重复步骤2，直到获得最大的模块度值。(In order to reduce the time complexity of the algorithm, Vincent Blondel et al. Proposed another hierarchical greedy algorithm (BGLL algorithm). The algorithm consists of two phases, which are repeated iteratively until the network community is divided by no longer growing. The first phase merges the community, and the algorithm treats each node as a community, based on the modularity maximization criteria, which neighbor communities should be merged. After the second phase of the scan, the algorithm will re-see all the communities found in the first stage as nodes, build new networks, and carry out the first phase on the new network. When the degree of the module is no longer increased, the optimal neighborhood of the community is obtained.) Platform: |
Size: 33792 |
Author:qljiang0203
|
Hits:
Description: 求网络图中各节点的度及度的分布曲线， 聚类系数及整个网络的聚类系数，和复杂网络中两节点的距离以及平均路径长度(Find the degree and degree distribution curve of each node in the network graph, the clustering coefficient and the clustering coefficient of the whole network, the distance between two nodes in the complex network and the average path length) Platform: |
Size: 2048 |
Author:Gao_ |
Hits:
Search - degree of network nodes